Symmetric matrix inversion using modified Gaussian elimination
نویسندگان
چکیده
In this paper we present two different variants of method for symmetric matrix inversion, based on modified Gaussian elimination. Both methods avoid computation of square roots and have a reduced machine time’s spending. Further, both of them can be used efficiently not only for positive (semi-) definite, but for any non-singular symmetric matrix inversion. We use simulation to verify results, which represented in this paper.
منابع مشابه
Fast symmetric matrix inversion using modified Gaussian elimination
In this paper we present two different variants of method for symmetric matrix inversion, based on modified Gaussian elimination. Both methods avoid computation of square roots and have a reduced machine time’s spending. Further, both of them can be used efficiently not only for positive (semi-) definite, but for any non-singular symmetric matrix inversion. We use simulation to verify results, ...
متن کاملSpeed Enhancement on a Matrix Inversion Hardware Architecture Based on Gauss-jordan Elimination Oh Eng Wei Universiti Teknologi Malaysia Speed Enhancement on a Matrix Inversion Hardware Architecture Based on Gauss-jordan Elimination Oh Eng Wei
Matrix inversion is a mathematical algorithm that is widely used and applied in many real time engineering applications. It is one of the most computational intensive and time consuming operations especially when it is performed in software. Gauss-Jordan Elimination is one of the many matrix inversion algorithms which has the advantage of using simpler mathematical operations to get the result....
متن کاملComputation of determinant
where Sn (also known as the symmetric group on n elements) is the set of all permutations of {1, 2, . . . , n}, i.e., all the ways of pairing up the n rows of the matrix with the n columns, and I(π) is the inversion number of π, the minimal number of transpositions of adjacent columns needed to turn π into the identity permutation. This formula [1] is practical for some simple matrices such as ...
متن کاملMinimum Degree Reordering Algorithms: A Tutorial
The problem of matrix inversion is central to many applications of Numerical Linear Algebra. When the matrix to invert is dense, little can be done to avoid the costly O(n) process of Gaussian Elimination. When the matrix is symmetric, one can use the Cholesky Factorization to reduce the work of inversion (still O(n), but with a smaller coefficient). When the matrix is both sparse and symmetric...
متن کاملConical Systolic Array for Matrix Inversion
Matrices have been used in many analytical and simulation models and numerical solutions. Matrix operations have essential role in many scientific and engineering applications. One of the most time-consuming operations among matrix operations is matrix inversion. Many hardware designs and software algorithms have been proposed to reduce the time of computation. They will be more important for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1504.06734 شماره
صفحات -
تاریخ انتشار 2015